Markov Chain Computation for Homogeneous and Non-Homogeneous Data:MARCH 1.1 Users Guide
نویسندگان
چکیده
منابع مشابه
Zipf and non-Zipf Laws for Homogeneous Markov Chain
Let us consider a homogeneous Markov chain with discrete time and with a finite set of states are nonrecurrent. The goal of this work is to study frequencies of trajectories in this chain, i.e., " words " composed of symbols E 1 ,. .. , E n ending with the " space " E 0. Let us order words according to their probabilities ; denote by p(t) the probability of the tth word in this list. In this pa...
متن کاملDiscrete Time Homogeneous and non-Homogeneous semi-Markov Reliability Models.∗
In this paper, we extend to our knowledge, for the first case, some reliability results obtained using homogeneous semi-Markov processes to the case of non-homogenous semi-Markov modelisation. Moreover, we apply some of our preceding results to give the numerical solutions and so the possibility to treat real life problems for which non-homogeneity in time is important.
متن کاملLong Term Behavior of Cyclic Non-Homogeneous Fuzzy Markov Chain
We consider cyclic non homogeneous fuzzy Markov chains where there are uncertainties in the transition possibilities. These uncertainties are modeled by triangular fuzzy number. Using the algorithm for finding the greatest eigen fuzzy sets we have analyzed the long term behavior of the system and this is illustrated with the numerical example. Mathematics Subject Classification: 03E72, 60J10
متن کاملNon Homogeneous Fermi Markov States
We investigate the structure of the non homogeneous Markov states on general Fermi algebras. This covers d–Markov states on the CAR algebra on Z, the case when there are more than one creators and annichilators in each site, and finally Fermi Markov fields on Z . Natural connections with the KMS boundary condition, diagonalizability, and entropy of Fermi Markov states are studied in detail. Apa...
متن کاملHomogeneous and Non Homogeneous Algorithms
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non-homogeneous algorithms.1 Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously ment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Software
سال: 2001
ISSN: 1548-7660
DOI: 10.18637/jss.v006.i03